SHORTEST PATH DETECTION USING CLONAL SELECTION ALGORITHM FOR ERZURUM METROPOLITAN MUNICIPALITY
نویسندگان
چکیده
منابع مشابه
Test Data Generation for Basis Path Testing Using Genetic Algorithm and Clonal Selection Algorithm
Test data is needed for testing the software which can be generated automatically and manually. Manual generation of test data involves a lot of efforts. Therefore automated test data generation methods are used. To find the suitable test data for a program, optimization should be applied on test data. In this paper, two optimization techniques, Genetic Algorithm (GA) and clonal selection algor...
متن کاملEuclidean Shortest Path Algorithm for Spherical Obstacles
One version of the Euclidean shortest path problem (ESP) is to find the shortest path such that it starts at p and ends at q and it avoids passing through an unordered set of pairwise disjoint obstacles. This paper describes an approximate algorithm for solving this ESP problem for two points p and q and a finite set of pairwise disjoint spheres in R not containing those two points. We apply th...
متن کاملPolicy Iteration Algorithm for Shortest Path Problems
Abstract. The shortest paths tree problem consists in finding a spanning tree rooted at a given node, in a directed weighted graph, such that for each node i , the path of the tree which goes from i to the root has minimal weight. We propose an algorithm which is a deterministic version of Howard’s policy iteration scheme. We show that policy iteration is faster than the Bellman (or value itera...
متن کاملBionomic Algorithm for Shortest Path First
In this paper we propose the idea of using Bionomic Algorithm (BA) for the shortest path finding problem. SPF is a very important issue associated with many other tasks like network routing and graph/map analysis etc. Different techniques have been used for solving the SPF problem, some of them being Dijkstra Algorithm, Floyd Algorithm, Genetic Algorithm, Tabu Search etc. The choice of algorith...
متن کاملThe FastMap Algorithm for Shortest Path Computations
We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. In this space, the Euclidean distance between any two nodes approximates the length of the shortest path between them in the given graph. Later, at runtime, a shortest path between any two nodes can be computed using A* search with the Euclidean distances as heurist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mugla Journal of Science and Technology
سال: 2017
ISSN: 2149-3596
DOI: 10.22531/muglajsci.357621